Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics
نویسندگان
چکیده
This talk will focus on preconditioning techniques for solving sequences of symmetric indefinite systems Aixi = bi, where the matrices Ai are supposed to slightly change. This case often arises in Computational Science and Engineering, for example when a Newton-type method is used to solve a nonlinear problem. With this aim in mind, we study the case of a sequence with a given matrix A ∈ Rn×n and multiple right-hand sides that are not known simultaneously. The idea is to generalize the class of Limited Memory Preconditioners, initially motivated by the BFGS method, analysed in [1] for A symmetric positive definite. The extension to the symmetric indefinite case leads us to study the following preconditioner H, constructed from a small set of k linearly independent vectors forming the columns of a matrix S:
منابع مشابه
Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners
Sparse symmetric indefinite linear systems of equations arise in numerous practical applications. In many situations, an iterative method is the method of choice but a preconditioner is normally required for it to be effective. In this paper, the focus is on a class of incomplete factorization algorithms that can be used to compute preconditioners for symmetric indefinite systems. A limited mem...
متن کاملPreconditioning Indefinite Systems in Interior-Point Methods for quadratic optimization
A new class of preconditioners is proposed for the iterative solution of symmetric indefinite systems arising from interior-point methods. The use of logarithmic barriers in interior point methods causes unavoidable ill-conditioning of linear systems and, hence, iterative methods fail to provide sufficient accuracy unless appropriately preconditioned. Now we introduce two types of preconditione...
متن کاملExtension of Two-level Schwarz Preconditioners to Symmetric Indefinite Problems TR2008-914
Two-level overlapping Schwarz preconditioners are extended for use for a class of large, symmetric, indefinite systems of linear algebraic equations. The focus is on an enriched coarse space with additional basis functions built from free space solutions of the underlying partial differential equation. GMRES is used to accelerate the convergence of preconditioned systems. Both additive and hybr...
متن کاملMultilevel Preconditioners for Non-self-adjoint or Indefinite Orthogonal Spline Collocation Problems
Efficient numerical algorithms are developed and analyzed that implement symmetric multilevel preconditioners for the solution of an orthogonal spline collocation (OSC) discretization of a Dirichlet boundary value problem with a non–self-adjoint or an indefinite operator. The OSC solution is sought in the Hermite space of piecewise bicubic polynomials. It is proved that the proposed additive an...
متن کاملOn Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems
Limited-memory incomplete Cholesky factorizations can provide robust preconditioners for sparse symmetric positive-definite linear systems. In this paper, the focus is on extending the approach to sparse symmetric indefinite systems in saddle-point form. A limited-memory signed incomplete Cholesky factorization of the form LDL is proposed, where the diagonal matrix D has entries ±1. The main ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016